Cyclic Labellings with Constraints at Two Distances
نویسندگان
چکیده
منابع مشابه
Cyclic Labellings with Constraints at Two Distances
Motivated by problems in radio channel assignment, we consider the vertexlabelling of graphs with nonnegative integers. The objective is to minimize the span of the labelling, subject to constraints imposed at graph distances one and two. We show that the minimum span is (up to rounding) a piecewise linear function of the constraints, and give a complete specification, together with the associa...
متن کاملAstrophysical constraints on modifying gravity at large distances
Recently, several interesting proposals were made modifying the law of gravity on large scales, within a sensible relativistic formulation. This allows a precise formulation of the idea that such a modification might account for galaxy rotation curves, instead of the usual interpretation of these curves as evidence for dark matter. Here we summarize several observational constraints that any su...
متن کاملLinear and cyclic distance-three labellings of trees
Given a finite or infinite graph G and positive integers `, h1, h2, h3, an L(h1, h2, h3)labelling of G with span ` is a mapping f : V (G) → {0, 1, 2, . . . , `} such that, for i = 1, 2, 3 and any u, v ∈ V (G) at distance i in G, |f(u)−f(v)| ≥ hi. A C(h1, h2, h3)-labelling of G with span ` is defined similarly by requiring |f(u)− f(v)|` ≥ hi instead, where |x|` = min{|x|, `− |x|}. The minimum sp...
متن کاملDistance-two labellings of Hamming graphs
Let j ≥ k ≥ 0 be integers. An `-L(j, k)-labelling of a graph G = (V , E) is a mapping φ : V → {0, 1, 2, . . . , `} such that |φ(u)−φ(v)| ≥ j if u, v are adjacent and |φ(u)−φ(v)| ≥ k if they are distance two apart. Let λj,k(G) be the smallest integer ` such that G admits an `-L(j, k)-labelling. Define λj,k(G) to be the smallest ` if G admits an `-L(j, k)-labelling with φ(V ) = {0, 1, 2, . . . , ...
متن کاملCorrelation Clustering with Stochastic Labellings
Correlation clustering is the problem of finding a crisp partition of the vertices of a correlation graph in such a way as to minimize the disagreements in the cluster assignments. In this paper, we discuss a relaxation to the original problem setting which allows probabilistic assignments of vertices to labels. By so doing, overlapping clusters can be captured. We also show that a known optimi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2004
ISSN: 1077-8926
DOI: 10.37236/1769